Minimizing Transmission Time under Required System Capacity Constraint in Stochastic-Flow Networks
نویسندگان
چکیده
منابع مشابه
Minimizing Average Flow-Time under Knapsack Constraint
We give the first logarithmic approximation for minimizing average flow-time of jobs in the subset parallel machine setting (also called the restricted assignment setting) under a single knapsack constraint. In a knapsack constraint setting, each job has a profit, and the set of jobs which get scheduled must have a total profit of at least a quantity Π. Our result extends the work of Gupta, Kri...
متن کاملOptimal flexible capacity in newsboy problem under stochastic demand and lead-time
In this paper, we consider a newsvendor who is going to invest on dedicated or flexible capacity, our goal is to find the optimal investment policy to maximize total profit while the newsvendor faces uncertainty in lead time and demand simultaneously. As highlighted in literature, demand is stochastic, while lead time is constant. However, in reality lead time uncertainty decreases newsvendor's...
متن کاملFuzzy completion time for alternative stochastic networks
In this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. In other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of network. Then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (TFN). This paper com...
متن کاملTransmission capacity: applying stochastic geometry to uncoordinated ad hoc networks
This paper summarizes recent contributions on the transmission capacity of ad hoc networks. Although it is notoriously difficult to derive general end-to-end capacity results for ad hoc networks, the transmission capacity framework allows for quantification of achievable single-hop rates by focusing on a simplified physical/MAC-layer model. By using stochastic geometry to quantify the multi-use...
متن کاملReliability Evaluation of Multi-source Multi- Sink Stochastic-flow Networks under Quickest Path and System Capacity Constraints
A multi-source multi-sink stochastic-flow network consists of a set of nodes, including sources nodes si that supply resources and sink nodes tj where demands are realized, and a set of directed arcs that carry resource flows. This paper presents an algorithm to determine the probability, called system reliability ( T C d ij wj R ), that for each source–sink pair (si, tj), dwj (the demand for r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Applied Sciences
سال: 2018
ISSN: 1546-9239
DOI: 10.3844/ajassp.2018.251.260